The separating gonality of a separating real curve
نویسندگان
چکیده
منابع مشابه
Rigidity of the Strongly Separating Curve Graph
We define the strongly separating curve graph to be the full subgraph of the curve graph of a compact orientable surface, where the vertex set consists of all separating curves which do not bound a three-holed sphere. We show that, for all but finitely many surfaces, any automorphism of the strongly separating curve graph is induced by an element of the mapping class group.
متن کاملSeparating Real Incentives and Accountability
In experimental investigations of the effect of real incentives, accountability—the implicit or explicit expectation of a decision maker that she may have to justify her decisions in front of somebody else—is often confounded with the incentives themselves. This confounding of accountability with incentives makes causal attributions of any effects found problematic. We separate accountability a...
متن کاملSeparating a Real-Life Nonlinear Image Mixture
When acquiring an image of a paper document, the image printed on the back page sometimes shows through. The mixture of the frontand back-page images thus obtained is markedly nonlinear, and thus constitutes a good real-life test case for nonlinear blind source separation. This paper addresses a difficult version of this problem, corresponding to the use of “onion skin” paper, which results in ...
متن کاملSeparating real motifs from their artifacts
The typical output of many computational methods to identify binding sites is a long list of motifs containing some real motifs (those most likely to correspond to the actual binding sites) along with a large number of random variations of these. We present a statistical method to separate real motifs from their artifacts. This produces a short list of high quality motifs that is sufficient to ...
متن کاملOn the gap between separating words and separating their reversals
A deterministic finite automaton (DFA) separates two strings w and x if it accepts w and rejects x. The minimum number of states required for a DFA to separate w and x is denoted by sep(w, x). The present paper shows that the difference ∣∣sep(w, x)− sep(w, xR)∣∣ is unbounded for a binary alphabet; here w stands for the mirror image of w. This solves an open problem stated in [Demaine, Eisenstat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Monatshefte für Mathematik
سال: 2012
ISSN: 0026-9255,1436-5081
DOI: 10.1007/s00605-012-0413-x